Inverse Eigenvalue Problem of Unitary Hessenberg Matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Solution of Inverse Eigenvalue Problems for Unitary Hessenberg Matrices

Let H ∈ Cn×n be an n × n unitary upper Hessenberg matrix whose subdiagonal elements are all positive. Partition H as H = H11 H12 H21 H22 , (0.1) where H11 is its k×k leading principal submatrix; H22 is the complementary matrix of H11. In this paper, H is constructed uniquely when its eigenvalues and the eigenvalues of b H11 and b H22 are known. Here b H11 and b H22 are rank-one modifications of...

متن کامل

On the nonnegative inverse eigenvalue problem of traditional matrices

In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

On an Inverse Eigenvalue Problem for Unitary

We show that a unitary upper Hessenberg matrix with positive subdiago-nal elements is uniquely determined by its eigenvalues and the eigenvalues of a modiied principal submatrix. This provides an analog of a well-known result for Jacobi matrices.

متن کامل

on the nonnegative inverse eigenvalue problem of traditional matrices

in this paper, at rst for a given set of real or complex numbers  with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which  is its spectrum. in continue we present some conditions for existence such nonnegative tridiagonal matrices.

متن کامل

The inverse eigenvalue problem via orthogonal matrices

In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce sufficient conditions for obtaining nonnegative matrices. We get the HROU algorithm from [1] and introduce some extension of this algorithm. If we have some eigenvectors and associated eigenvalues of a matrix, then by this extension we can find the symmetric matrix that its eigenvalue and eigenvec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Dynamics in Nature and Society

سال: 2009

ISSN: 1026-0226,1607-887X

DOI: 10.1155/2009/615069